Closure of Language Classes Under Bounded Duplication
نویسندگان
چکیده
Duplication is an operation generating a language from a single word by iterated application of rewriting rules u → uu on factors. We extend this operation to entire languages and investigate, whether the classes of the Chomsky hierarchy are closed under duplication. Here we treat mainly bounded duplication, where the factors duplicated cannot exceed a given length. While over two letters the regular languages are closed under bounded duplication, over three or more letters they are not, if the length bound is 4 or greater. For 2 they are closed under duplication, the case of 3 remains open. Finally, the class of context-free languages is closed under duplication over alphabets of any size.
منابع مشابه
Bounded Prefix-Suffix Duplication
Abs t r ac t . We consider a restricted variant of the prefix-sufñx duplication operation, called bounded prefix-sufñx duplication. It consists in the iterative duplication of a prefix or suffix, whose length is bounded by a constant, of a given word. We give a sufncient condition for the closure under bounded prefix-sufñx duplication of a class of languages. Consequently, the class of regular ...
متن کاملDuplication Closure of Regular Languages
In the present paper, we prove that the n-bounded duplication closure of a regular language is regular for n = 1, 2.
متن کاملTree-width and the monadic quantifier hierarchy
It is well known that on classes of graphs of bounded tree-width, every monadic second-order property is decidable in polynomial time. The converse is not true without further assumptions. It follows from the work of Robertson and Seymour, that if a class of graphs K has unbounded tree-width and is closed under minors, then K contains all planar graphs. But on planar graphs, three-colorability ...
متن کاملOn the properties of language classes defined by bounded reaction automata
Reaction automata are a formal model that has been introduced to investigate the computing powers of interactive behaviors of biochemical reactions([14]). Reaction automata are language acceptors with multiset rewriting mechanism whose basic frameworks are based on reaction systems introduced in [4]. In this paper we continue the investigation of reaction automata with a focus on the formal lan...
متن کاملCharacterization of Context-Free Languages with Polynomially Bounded Ambiguity
We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections which deletes Parikh bounded symbols only. A symbol a is Parikh bounded in a language L if there is a constant c such that no word of L contains more than c occurrences of a. Furthermore PCFL is closed under the formally stron...
متن کامل